| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZeBBx/GKsqL |
| Repository | sid.inpe.br/banon/2005/07.13.20.58 |
| Last Update | 2005:07.14.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2005/07.13.20.58.22 |
| Metadata Last Update | 2022:09.13.03.42.53 (UTC) administrator |
| DOI | 10.1109/SIBGRAPI.2005.17 |
| Citation Key | FariasScheCombVelh:2005:BoOpSu |
| Title | Boolean operations on surfel-bounded objects using constrained BSP-trees  |
| Format | On-line |
| Year | 2005 |
| Access Date | 2024, May 02 |
| Number of Files | 1 |
| Size | 531 KiB |
| 2. Context | |
| Author | 1 Farias, Marcus A. C. 2 Scheidegger, Carlos E. 3 Comba, João L. D. 4 Velho, Luiz Carlos Pacheco Rodrigues |
| Affiliation | 1 Instituto de Informática, UFRGS 2 Scientific Computing and Imaging Institute, University of Utah 3 Instituto de Matem´atica Pura e Aplicada |
| Editor | Rodrigues, Maria Andréia Formico Frery, Alejandro César |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI) |
| Conference Location | Natal, RN, Brazil |
| Date | 9-12 Oct. 2005 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| History (UTC) | 2008-08-26 15:17:02 :: banon -> administrator :: 2009-08-13 20:37:50 :: administrator -> banon :: 2010-08-28 20:01:18 :: banon -> administrator :: 2022-09-13 03:42:53 :: administrator -> :: 2005 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | BSP-trees Boolean operations operações Booleanas surfel |
| Abstract | Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and many algorithms have been devised to their efficient manipulation and rendering. Key to the efficiency of many methods is the use of partitioning schemes, and usually axis-aligned structures such as octrees and KD-trees are preferred, instead of more general BSP-trees. In this work we introduce a data structure called Constrained BSPtree (CBSP-tree) that can be seen as an intermediate structure between KD-trees and BSP-trees. The CBSP-tree is characterized by allowing arbitrary cuts as long as the complexity of its cells remains bounded, allowing better approximation of curved regions. We discuss algorithms to build CBSP-trees using the flexibility that the structure offers, and present a modified algorithm for boolean operations that uses a new inside-outside object classification. Results show that CBSP-trees generate fewer cells than axisaligned structures. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2005 > Boolean operations on... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Boolean operations on... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZeBBx/GKsqL |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/GKsqL |
| Language | en |
| Target File | fariasm_constrained_bsp.pdf |
| User Group | banon administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46R3ED5 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.05.04.08 8 sid.inpe.br/banon/2001/03.30.15.38.24 1 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |